Algebraic generalization of Diffie–Hellman key exchange
نویسندگان
چکیده
منابع مشابه
Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups
Author: Ayan Mahalanobis Title: Diffie-Hellman Key Exchange Protocol, its Generalization and Nilpotent Groups Dissertation Advisor: Dr. Spyros Magliveras Degree: Doctor of Philosophy Year: 2005 This dissertation has two chapters. In the first chapter we talk about the discrete logarithm problem, more specifically we concentrate on the Diffie-Hellman key exchange protocol. We survey the current ...
متن کاملPolynomial time cryptanalysis of noncommutative-algebraic key exchange protocols
We introduce the linear centralizer method for a passive adversary to extract the shared key in group-theory based key exchange protocols (KEPs). We apply this method to obtain a polynomial time cryptanalysis of the Commutator KEP, introduced by Anshel–Anshel–Goldfeld in 1999 and considered extensively ever since. We also apply this method to the Centralizer KEP, introduced by Shpilrain–Ushakov...
متن کاملA security solution for IEEE 802.11's ad hoc mode: password-authentication and group DiffieHellman key exchange
The IEEE 802 standards ease the deployment of networking infrastructures and enable employers to access corporate networks while traveling. These standards provide two modes of communication called infrastructure and ad-hoc modes. A security solution for the IEEE 802.11’s infrastructure mode took several years to reach maturity and firmware are still been upgraded, yet a solution for the ad-hoc...
متن کاملAlgebraic generalization of quantum statistics
Generalized quantum statistics such as para-Bose and para-Fermi statistics are related to the basic classical Lie superalgebras B(0|n) and Bn. We give a quite general definition of “a generalized quantum statistics associated to a Lie superalgebra G”. This definition is closely related to a certain Z-grading of G. The generalized quantum statistics is determined by a set of root vectors (the cr...
متن کاملAlgebraic Generalization of Venn Diagram
It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture becomes more complicated, that's why we thought at the following codification. That’s why we propose an easy and systematic algebraic way of dealing with the representation of intersections and unions of many sets. Introduction. Let's first consider 1 ≤ n ≤ 9, and the sets S1, S2, ..., Sn. Then one gets 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2018
ISSN: 1862-2976,1862-2984
DOI: 10.1515/jmc-2017-0015